منابع مشابه
Jesu, Joy of Man's Desiring
|---------------0---|---3-2-3-----------|-----0-------------|-------------------| |-------0-3-1-1---3-|-3-------3-0-----0-|-1-3---3-1-0---0---|-------------1-0---| 3 |---0-2-0-----2-----|-------------0-2---|-------------2---0-|---0-2-----2-----2-| 4 |-------------------|-------2-----------|-------------------|-4-----0-4---0-----| |-------------------|-2-----------------|-0-----2-----3-----|-5--...
متن کاملColloquia Mathematica Societatis
For any infinite cardinal K define a family .F of sets to be a Kalmost-disjoint family (K-ADF) iff U y has cardinality K, each member of .F has cardinality K, and the intersection of any two distinct members of F has cardinality strictly less than K . Define such a family to be a K-maximal almost-disjoint family (K-MADF) iff for every set S c U 'F of cardinality K there exists a set FEE JF* who...
متن کاملColloquia Mathematica Societatis Janos Bolyai
The authors continue their study of extremal problems of Turán type for directed graphs with multiple edges, now permitting any finite nonnegative integer multiplicity . Having proved earlier (for the case of multiplicity at most 1) that there exists, for any family of "sample" digraphs, a matrix which represents the structure of an "asymptotically extremal sequence" of digraphs (containing non...
متن کاملColloquia Mathematica Societatis János Bolyai
1 . Our investigations might be suggested by a sort of optimalization problem which could be described vividly in practical terms as follows : suppose we are given a network of routes on which there are critical points endangered by fire. We want to place fire stations at an appropriate number of points from which any endangered point can be reached within a given time interval in case of emerg...
متن کاملColloquia Mathematica Societatis János Bolyai
For a given finite graph G and positive integer k, let r(G ; k) denote the least integer r such that if the edges of Kr , the complete graph on r vertices, are arbitrarily partitioned into k classes then some class contains a subgraph isomorphic to G . The existence of r(G ; k) follows at once from the well-known theorem of R a m s e y {8] which asserts that r(Kn ; k) < for all n and k . In thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Hispanic American Historical Review
سال: 1952
ISSN: 0018-2168,1527-1900
DOI: 10.1215/00182168-32.1.138